Finding Related Hubs and Authorities
نویسندگان
چکیده
HubFinder is intended to be an algorithm for finding hubs related to an initial base set of pages. We define related as accessible via the link structure of the Web (following either in-going or out-going links). When searching for related hubs, one would probably need to apply the Kelinberg extension several times, because if one starts from a poor hub/authorithy, the representative pages might be placed quite a few links away. HubFinder improves this by decreasing the amount of pages kept after each Kleinberg extension and thus increasing computation speed. Our idea has the following skeleton as algorithm basis:
منابع مشابه
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains
In this work, we show that Kleinberg’s hubs and authorities model is closely related to both correspondence analysis, a well-known multivariate statistical technique, and a particular Markov chain model of navigation through the web. The only difference between correspondence analysis and Kleinberg’s method is the use of the average value of the hubs (authorities) scores for computing the autho...
متن کاملSome relationships between Kleinberg’s hubs and authorities, correspondence analysis, and the Salsa algorithm
In this work, we show that Kleinberg’s hubs and authorities model is closely related to both correspondence analysis, a well-known multivariate statistical technique, and a particular Markov chain model of navigation through the web. The only difference between correspondence analysis and Kleinberg’s method is the use of the average value of the hubs (authorities) scores for computing the autho...
متن کاملCS599: Structure and Dynamics of Networked Information (Spring 2005) 02/07/2005: The Search for Communities
We previously looked at communities as simply dense subgraphs graphs, or as subgraphs such that each node has a large fraction of its edges inside. Another view, taken in [3], starts from the hubs and authorities model. It argues that a structure of densely linked hubs and authorities is a common feature of communities. Such a core, a dense bipartite graph, can be considered the “signature” of ...
متن کاملFinding Authorities and Hubs FromLink Structures on the World Wide
Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best \authorities" for a given topic or query. While such analysis is usually combined with content analysis, there is a sense in which some algorithms are deemed to be \more balanced" and others \more focused". We undertake a comparative study of hypertext link analysis algor...
متن کاملThe stochastic approach for link-structure analysis (SALSA) and the TKC effect
Today, when searching for information on the World Wide Web, one usually performs a query through a term-based search engine. These engines return, as the query’s result, a list of Web sites whose contents match the query. For broad topic queries, such searches often result in a huge set of retrieved documents, many of which are irrelevant to the user. However, much information is contained in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003